Non-deterministic FORTRAN

Deterministic Parallel FORTRAN

We describe Fortran M, message-passing extensions to Fortran 77 that provide deterministic execution and information hiding while preserving desirable properties of message passing.

Deterministic vs Non-deterministic Graph Property Testing

A graph property P is said to be testable if one can check whether a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-deterministically testable if one can supply a “certificate” to the fact that a graph satisfies P so that once the certificate is given its correctness can be tested. The notion of non-deterministic testing of graph propert...

Deterministic and Non-Deterministic Stable Models

Training Deterministic Parsers with Non-Deterministic Oracles

Greedy transition-based parsers are very fast but tend to suffer from error propagation. This problem is aggravated by the fact that they are normally trained using oracles that are deterministic and incomplete in the sense that they assume a unique canonical path through the transition system and are only valid as long as the parser does not stray from this path. In this paper, we give a gener...

Non-deterministic Processors

New techniques have been discovered to find the secret keys stored in smart-cards. These techniques have caused concern for they can allow people to recharge their smartcards (in effect printing money), or illegally use phone or digital TV services. We propose a new processor design which will counteract these techniques. By randomising the instruction stream being executed by the processor we ...